Geometric Solution of Shape from Shading Problem

نویسندگان

  • Seong Ik CHO
  • Hideo SAITO
  • Shinji OZAWA
چکیده

A new geometrical approach in solving the shape from shading problem of Lambertian model is discussed. It is shown, through the global and local geometrical analysis, that the problem is bound by two local constraints. The C 1 continuous analytic solution is derived. The solution has two degrees of freedom due to the non-linearity of the problem. This shows the existence and the non-uniqueness of the solution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cooperative Algorithm for Determining Surface Orientation from a Single View

This paper addresses the problem of determining local surface orientation from the intensity information contained in a single monocular view. It represents another look at the problem of obtaining shape from shading information. This problem was first formulated by as the solution of first-order non-linear partial differential equations. It was subsequently reformulated by <Horn 19...

متن کامل

Photometric and Geometric Restoration of Document Images Using Inpainting and Shape-from-Shading

The popularity of current hand-held digital imaging devices such as camera phones, PDAs, camcorders has promoted the use of digital cameras to capture document images for daily information recording purpose. However, the captured images often contain photometric and geometric distortions when the documents are of non-planar shapes, which cause significant problems to various document image anal...

متن کامل

Shape - from - shading on a cloudy day

In the classical shape-from-shading model, surface luminance depends primarily on the unit surface normal. However, under diffuse lighting conditions, such as the sky on a cloudy day, luminance depends primarily on the amount of sky that is visible from each surface element, with surface normal of secondary importance. This claim is formalized in terms of a dominating sky principle and a surfac...

متن کامل

LINEAR , DISCRETE , AND QUADRATIC CONSTRAINTS IN SINGLE - IMAGE 3 D RECONSTRUCTION by Ady Ecker

Linear, Discrete, and Quadratic Constraints in Single-Image 3D Reconstruction Ady Ecker Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2010 In this thesis, we investigate the formulation, optimization and ambiguities in single-image 3D surface reconstruction from geometric and photometric constraints. We examine linear, discrete and quadratic constraints for ...

متن کامل

The Lawn-Mowing Algorithm for noisy gradient vector elds

In this paper we analyze a speci c problem within the context of recovering the geometric shape of an unknown surface frommultiple noisy shading patterns generated by consecutive parallel illuminations by di erent light-sources. Shading-based single-view shape recovery in computer vision often leads to vector elds (i.e. estimated surface normals) which have to be integrated for calculations of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998